Tower of Hanoi, revisited
نویسنده
چکیده
Another version of programming ‘The Tower of Hanoi’ in TEX is provided. No nodding knowledge of Lisp is required; just plain TEX. There is no restriction on the number of disks, apart from the installed limits of TEX. Generalized disks can be moved as well.
منابع مشابه
The Tower of Hanoi and Finite Automata
Some of the algorithms for solving the Tower of Hanoi puzzle can be applied “with eyes closed” or “without memory”. Here we survey the solution for the classical tower of Hanoi that uses finite automata, as well as some variations on the original puzzle. In passing, we obtain a new result on morphisms generating the classical and the lazy tower of Hanoi, and a new result on auomatic sequences.
متن کاملBrain Activation in the Prefrontal Cortex during Motor and Cognitive Tasks in Adults
The prefrontal cortex (PFC) plays an important role in cognitive function, involved in Executive Functions (EFs) such as planning, working memory, and inhibition. Activation in the PFC also occurs during some motor activities. One commonly used tool to assess EF is the Tower of Hanoi, demonstrating sensitivity to PFC dysfunction. However, limited neuroimaging evidence is available to support th...
متن کاملExplorations in 4-peg Tower of Hanoi
Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D repre...
متن کاملCombinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.
متن کاملThe Magnetic Tower of Hanoi
In this work I study a modified Tower of Hanoi puzzle, which I term Magnetic Tower of Hanoi (MToH). The original Tower of Hanoi puzzle, invented by the French mathematician Edouard Lucas in 1883, spans "base 2". That is – the number of moves of disk number k is 2^(k-1), and the total number of moves required to solve the puzzle with N disks is 2^N 1. In the MToH puzzle, each disk has two distin...
متن کامل